Uncovering deterministic causal structures: a Boolean approach
نویسندگان
چکیده
منابع مشابه
Uncovering deterministic causal structures: a Boolean approach
While standard procedures of causal reasoning as procedures analyzing causal Bayesian networks are custom-built for (non-deterministic) probabilistic structures, this paper introduces a Boolean procedure that uncovers deterministic causal structures. Contrary to existing Boolean methodologies, the procedure advanced here successfully analyzes structures of arbitrary complexity. It roughly invol...
متن کاملInferring deterministic causal relations
We consider two variables that are related to each other by an invertible function. While it has previously been shown that the dependence structure of the noise can provide hints to determine which of the two variables is the cause, we presently show that even in the deterministic (noise-free) case, there are asymmetries that can be exploited for causal inference. Our method is based on the id...
متن کاملNon-deterministic Boolean Proof Nets
We introduce Non-deterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Non-deterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean types, we prove that the cut-elimination procedure corresponds to Non-deterministic Boolean circuit...
متن کاملCausal structures and causal boundaries
We give an up-to-date perspective with a general overview of the theory of causal properties, the derived causal structures, their classification and applications, and the definition and construction of causal boundaries and of causal symmetries, mostly for Lorentzian manifolds but also in more abstract settings. PACS numbers: 04.20.Gz, 04.20.Cv, 02.40.Ky
متن کاملA Deterministic Optimization Approach for Generating Highly Nonlinear Balanced Boolean Functions in Cryptography
Boolean functions play an important role in cryptography, especially in S-box analysis. They are elementary building blocks for various cryptographic algorithms stream ciphers, block ciphers, hash functions, etc. Cryptography needs ways to find good Boolean functions so that ciphers can resist cryptanalytic attack. The main properties required are high nonlinearity and low autocorrelation, so t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2008
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-008-9348-0